Graph minor - PDFSEARCH.IO - Document Search Engine

Graph minor
Results: 171

#	Item
61	CCCG 2011, Toronto ON, August 10–12, 2011 Rigid components in fixed-lattice and cone frameworks∗ Matthew Berardi† Brent Heeringa‡ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:14 Dense graph Minor Matroid theory Structural rigidity Shortest path problem Pseudoforest Edge coloring Graph theory Graph coloring Laman graph
62	Nonconstructive Tools for Proving Polynomial-Time Decidability MICHAEL R. Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:12:08 Planar graphs Graph coloring Line graph Robertson–Seymour theorem Graph theory Minor Graph operations
63	On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 02:54:05 Robertson–Seymour theorem Tree decomposition Minor Planar graph Linkless embedding Graph coloring Graph structure theorem Clique-sum Graph theory Graph operations Path decomposition
64	Curriculum Vitae Personal Dates Name: Ken-ichi Kawarabayashi Add to Reading List Source URL: research.nii.ac.jp Language: English - Date: 2012-10-11 03:26:00 Graph Clique Combinatorics Cubic graph Chordal graph Tree decomposition Tree Planar graphs Víctor Neumann-Lara Graph theory Graph operations Minor
65	Crossing-Number Critical Graphs have Bounded Path-width Petr Hlinˇ en´ y? School of Mathematical and Computing Sciences, Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2005-02-11 15:58:00 Tree Graph property Induced path Minor Graph Planar graph End Mycielskian Line graph Graph theory Path decomposition Crossing number
66	ELSEVIER Information Processing Letters Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:07:31 Tree decomposition Robertson–Seymour theorem Minor Chordal graph Tree Graph Planar graphs Degeneracy Clique-sum Graph theory Path decomposition Graph operations
67	Suggestions on “Traversals of Object Structures: Specification and Efficient Implementation” by Karl Lieberherr and Boaz Patt-Shamir Yannis Smaragdakis () Section 1 contains general suggestions. Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 1998-12-29 22:20:29 Minor Graph operations Edge coloring Graph theory Graph Graph coloring
68	Planar Emulators Conjecture Is Nearly True for Cubic Graphs Martin Derkaa , Petr Hlinˇen´ yb,1 a David Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2013-12-16 02:39:42 Neighbourhood Topological graph theory Graph operations Graph structure theorem Graph theory Minor Planar graph
69	Discrete Mathematics–252 www.elsevier.com/locate/disc Forbidden minors to graphs with small feedback sets Michael J. Dinneena;∗ , Kevin Cattellb , Michael R. Fellowsb Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:07:31 Tree decomposition Robertson–Seymour theorem Minor Planar graphs Feedback vertex set Forbidden graph characterization Permutation graph Tree Graph Graph theory Graph operations Path decomposition
70	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 On the Complexity of Point Recolouring in Geometric Graphs Henk Meijer Roosevelt Academy Middelburg, The Netherlands Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:04:47 Planar graphs Graph Minor Edge coloring Apollonian network Graph theory Mathematics Graph coloring

UPDATE